Visual Tracking Using L2 Minimization
نویسندگان
چکیده
منابع مشابه
Robust visual tracking using ℓ1 minimization
In this paper we propose a robust visual tracking method by casting tracking as a sparse approximation problem in a particle filter framework. In this framework, occlusion, corruption and other challenging issues are addressed seamlessly through a set of trivial templates. Specifically, to find the tracking target at a new frame, each target candidate is sparsely represented in the space spanne...
متن کاملVisual Tracking using Kernel Projected Measurement and Log-Polar Transformation
Visual Servoing is generally contained of control and feature tracking. Study of previous methods shows that no attempt has been made to optimize these two parts together. In kernel based visual servoing method, the main objective is to combine and optimize these two parts together and to make an entire control loop. This main target is accomplished by using Lyapanov theory. A Lyapanov candidat...
متن کاملvisual tracking using kernel projected measurement and log-polar transformation
visual servoing is generally contained of control and feature tracking. study of previous methods shows that no attempt has been made to optimize these two parts together. in kernel based visual servoing method, the main objective is to combine and optimize these two parts together and to make an entire control loop. this main target is accomplished by using lyapanov theory. a lyapanov candidat...
متن کاملConstructive Discrepancy Minimization with Hereditary L2 Guarantees
In discrepancy minimization problems, we are given a family of sets S = {S1, . . . , Sm}, with each Si ∈ S a subset of some universe U = {u1, . . . , un} of n elements. The goal is to find a coloring χ : U → {−1,+1} of the elements of U such that each set S ∈ S is colored as evenly as possible. Two classic measures of discrepancy are l∞-discrepancy defined as disc∞(S , χ) := maxS∈S | ∑ ui∈S χ(u...
متن کاملVerifying global minima for L2 minimization problems
We consider the least-squares (L2) triangulation problem and structure-and-motion with known rotatation, or known plane. Although optimal algorithms have been given for these algorithms under an L-infinity cost function, finding optimal least-squares (L2) solutions to these problems is difficult, since the cost functions are not convex, and in the worst case can have multiple minima. Iterative ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: MATEC Web of Conferences
سال: 2016
ISSN: 2261-236X
DOI: 10.1051/matecconf/20166102020